package easy;

import java.util.HashMap;
import java.util.Map;

public class Solution_292 {

    public static boolean canWinNim(int n) {
        /*if (n<4) {
            return true;
        }
        int[] arr = new int[n];
        arr[0] = arr[1] = arr[2] = 1;
        // 我先手
        for (int i = 3; i < n; i++) {
            if (arr[i-1]==0 || arr[i-2]==0 || arr[i-3]==0) {
                arr[i] = 1;
            } else {
                arr[i] = 0;
            }
            System.out.print("i:"+(i+1)+"="+arr[i]+"    ");
        }
        System.out.println();
        return arr[n-1]==1;*/
        return n%4!=0;
    }

    public static void main(String[] args) {
        System.out.println(canWinNim(23));
    }
}
